Fall 2008: EE360C Algorithms Description This course aims to study combinatorial algorithms. We will begin by reviewing discrete mathematics. We will then study measuring program performance using the big-O notation. Fol

Source URL: users.ece.utexas.edu

American Concrete Institute (ACI) Journal Documentation Style Introduction This document is intended as a resource for students instructed to complete coursework according to ACI style guidelines. It is based on informat

Source URL: writingcenter.mst.edu

• Mathematical notation
• Notation
• Punctuation
• Mathematics
• Bibliography
• Numeral systems
• Language
• Bracket
• Citation
• Big O notation
• Scientific notation
• Parenthetical referencing

Optimal Staged Self-Assembly of General Shapes∗ Cameron Chalk1 , Eric Martinez1 , Robert Schweller1 , Luis Vega1 , Andrew Winslow2 , and Tim Wylie1 1 Department of Computer Science

Source URL: www.eecs.tufts.edu

• Mathematical analysis
• Analysis of algorithms
• Mathematics
• Asymptotic analysis
• Computer science
• Big O notation
• Mathematical notation
• Bin
• FO
• Loglog plot
• Logarithm

The Practical Use of the Bemer Method for Exponentials Update Version: September 5, 2006 Ron Doerfler (http://www.myreckonings.com) In Chapter 4 of my book, Dead Reckoning: Calculating Without Instruments, a method is gi

Source URL: www.myreckonings.com

• Mathematics
• Mathematical analysis
• Special functions
• Logarithms
• Mathematical notation
• Binary operations
• Mental calculation
• Common logarithm
• Natural logarithm
• Pi
• Big O notation
• Exponentiation

JMLR: Workshop and Conference Proceedings vol 40:1–18, 2015 Learning the dependence structure of rare events: a non-asymptotic study Nicolas Goix Anne Sabourin

Source URL: jmlr.org

• Mathematical analysis
• Mathematics
• Analysis
• Probability distributions
• Normal distribution
• Big O notation
• Limit of a function
• Exponentiation
• Central limit theorem
• Chebyshev function
• Heat equation

New towers over finite fields Henning Stichtenoth, Sabanci University, Istanbul, Turkey The aim of this talk is to present a recent result by A. Bassa, P. Beelen, A. Garcia and H. Stichtenoth, which includes and generali

Source URL: www.math.uni-magdeburg.de

• Mathematics
• Mathematical analysis
• Algebraic geometry
• Coding theory
• Algebraic curves
• GilbertVarshamov bound
• Finite field
• Modular curve
• Big O notation
• Arnaldo Garcia

Programming Techniques S.L. Graham, R.L. Rivest Editors

Source URL: bioinfo.ict.ac.cn

• Abstract data types
• Mathematics
• Software engineering
• Computer programming
• Analysis of algorithms
• Asymptotic analysis
• Binary trees
• Binomial heap
• Priority queue
• Minimum spanning tree
• Big O notation
• Heap

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

Counting in the Presence of Memory Faults Gerth Stølting Brodal1 , Allan Grønlund Jørgensen1 , Gabriel Moruz2,? , and Thomas Mølhave3,?? 1 2

Source URL: users.cs.duke.edu

• Circuit complexity
• NC
• Big O notation
• Mathematics
• Theoretical computer science
• Computer science